# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def majorityElement(self, nums: List[int]) -> int:
        count = 0
        candidate = -1

        for num in nums:
            if count == 0:
                candidate = num

            if candidate == num:
                count += 1
            else:
                count -= 1

        count = 0
        for num in nums:
            if num == candidate:
                count += 1

        if count * 2 > len(nums):
            return candidate
        else:
            return -1


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        ([1, 2, 3], -1),
        ([1, 2, 5, 9, 5, 9, 5, 5, 5], 5),
        ([3, 2], -1),
        ([2, 2, 1, 1, 1, 2, 2], 2)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]

        exec_result = solution.majorityElement(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

